Budgeted Profit Maximization Under the Multiple Products Independent Cascade Model
نویسندگان
چکیده
منابع مشابه
Budgeted Influence Maximization for Multiple Products
The typical algorithmic problem in viral marketing aims to identify a set of influential users in a social network, who, when convinced to adopt a product, shall influence other users in the network and trigger a large cascade of adoptions. However, the host (the owner of an online social platform) often faces more constraints than a single product, endless user attentions, unlimited budget and...
متن کاملInfluence Maximization in the Independent Cascade Model
We present our ongoing work on the problem of increasing the information spread in a network by creating a limited amount of new edges incident to a given initial set of active nodes. As a preliminary result, we give a constant approximation algorithm for the case in which the set of initial active nodes is a singleton. Our aim is to extend this result to the general case. We outline some furth...
متن کاملASIM: A Scalable Algorithm for Influence Maximization under the Independent Cascade Model
The steady growth of graph data from social networks has resulted in wide-spread research in finding solutions to the influence maximization problem. Although, TIM [4] is one of the fastest existing algorithms, it cannot be deemed scalable owing to its exorbitantly high memory footprint. In this paper, we address the scalability aspect – memory consumption and running time of the influence maxi...
متن کاملEfficient Influence Maximization in Weighted Independent Cascade Model
Influence maximization(IM) problem is to find a seed set in a social network which achieves the maximal influence spread. This problem plays an important role in viral marketing. Numerous models have been proposed to solve this problem. However, none of them considers the attributes of nodes. Paying all attention to the structure of network causes some trouble applying these models to real-word...
متن کاملOnline Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback
We study a stochastic online problem of learning to influence in a social network with semi-bandit feedback, individual observations of how influenced users influence others. Our problem combines challenges of partial monitoring, because the learning agent only observes the influenced portion of the network, and combinatorial bandits, because the cardinality of the feasible set is exponential i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2897608